Computing the probability of gene trees concordant with the species tree in the multispecies coalescent

The multispecies coalescent process models the genealogical relationships of genes sampled from several species, enabling useful predictions about phenomena such as discordance between a gene tree and species phylogeny due to incomplete lineage sorting. Conversely, knowledge large collections trees can inform us aspects phylogeny, its topology ancestral population sizes. A fundamental open problem in this context is how efficiently compute probability topology, given phylogeny. Although number algorithms for task have been proposed, they either produce approximate results, or, when are exact, do not scale data sets. In paper, we present some progress towards exact efficient computation topology. We provide new algorithm that, each calculates that will be concordant with tree. Moreover, an computes any specific Both run polynomial time implemented Python. Experiments show able analyze sets where thousands matter minutes hours.